home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Merciful 2
/
Merciful - Disc 2.iso
/
software
/
e
/
experiment4codersdisk2.dms
/
experiment4codersdisk2.adf
/
NippyZippy_readme.txt
< prev
next >
Wrap
Text File
|
1992-09-02
|
3KB
|
64 lines
______________________________________________________________________________
/
/
\ /\/ /\/
/
\ _________ ____ ____ ____ ____ /\ /
.---\_ __ /| ¡ | ¡ |----. /
|:::| / | | | | |::::| \ /
|:::| ___|__ | __| | |__.:| \/
|:::| | | | |:|
|:::| ¡ | ¡ |----. .--':|
/|:::| | | | | |::::|
/ `---^--------^----^----' `----^----'
\ / \ /
\/ / »»»»»-[ pRoUDLY pReSeNTS ]-«««««« /\ /
/ \ / \ /
/\ / \/ \ /
/ \/ \ /
/ AEPassword Encryption - *FULL SOURCE-CODE* \/
The Complete Assembly source-code is supplied!
/
______________________________________________________________________________
*******************************************************************************
* NiPPY-ZiPPY $1.01 (aSSeMBLY-sOURCE-cODE!)
* ¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯
* After seeing "Turbo Zippy`s" claims to be the fastest MC68k search routine
* ever to be devised I looked at it with interest. Does it live upto its claims
* to be the FASTEST search ever?? NO!!! Introducing "NiPPY-ZiPPY"... Now I
* myself *WONT* make any foolish claims that *MY* search routine is the fastest
* ever made like "Turbo Zippy" did but I will say that my one is MUCH MUCH
* faster that Turbo Zippy`s search routine ever dreamed of being!
*
* "NiPPY-ZiPPY" reaches search speeds of around 700kb per second!!!
* Tested on a standard A12oo, 14Mz MC68o2o without fastmem. As I cannot be
* bothered to write an Ami-Express "Z"ippy door at the moment I have decided
* to release my search routine for all to see. Hopefully someone will bother
* to use the searching source in their zippy door and you`ll be searching like
* you never searched before...VIRTUALLY INSTANTLY (hehe)
*
* Okay so the code isn`t very well structured and could be reduced in size
* but I could only see reductions in the code size slowing down the search
* routine... 2k isn`t that bad... Think of it this way.. if it where written
* in C it would be the same size and STILL be slow.. (hahaha)
*
* INPUTS ; a0.l=start address for search
* a1.l=end address for search
* a2.l=string to search for
*
* OUTPUTS; d0.b=If failed to located string =$FF.B, else =$00.B FOUND!
* a0.l=ptr to string
*******************************************************************************
______________________________________________________________________________
End